Papers with Low-rank adaptation
Towards Federated Low-Rank Adaptation of Language Models with Rank Heterogeneity (2025.naacl-short)
Copied to clipboard
| Challenge: | Low-rank adaptation (LoRA) is an efficient alternative to full-weight adaptation in federated fine-tuning of language models, significantly reducing computational costs. |
| Approach: | They propose a low-rank adaptation method that freezes original weights and trains only the update parametrized as a product of two low-ranked matrices. |
| Outcome: | The proposed method accelerates convergence and enhances the global model’s predictive performance. |
ALoRA: Allocating Low-Rank Adaptation for Fine-tuning Large Language Models (2024.naacl-long)
Copied to clipboard
| Challenge: | Low-rank adaptation (LoRA) has demonstrated commendable performance as a popular method . however, it is implemented with a fixed intrinsic rank that might not be ideal for downstream tasks. |
| Approach: | They propose a method that estimates the importance score of each LoRA rank and prunes abundant LoRA ranks to improve performance. |
| Outcome: | The proposed method outperforms baselines on a variety of tasks with comparable parameters. |
RB-LoRA: Rank-Balanced Aggregation for Low-Rank Adaptation with Federated Fine-Tuning (2026.findings-eacl)
Copied to clipboard
| Challenge: | Low-rank adaptation (LoRA) improves fine-tuning of foundation models by updating only compact adapter matrices . varying client device capabilities lead to different adapter ranks, causing rank heterogeneity that undermines aggregation. |
| Approach: | They propose a rank-balanced aggregation framework that decomposes each update into rank-wise components and aligns them using analytically derived weights. |
| Outcome: | Experiments on language and vision models show that RB-LoRA improves under one and three rounds of communication in federated learning environments. |
MELoRA: Mini-Ensemble Low-Rank Adapters for Parameter-Efficient Fine-Tuning (2024.acl-long)
Copied to clipboard
Pengjie Ren, Chengshun Shi, Shiguang Wu, Mengqi Zhang, Zhaochun Ren, Maarten Rijke, Zhumin Chen, Jiahuan Pei
| Challenge: | Large language models (LLMs) are the default paradigm for natural language processing (NLP) as the models’ scale and the diversity of tasks increase, fine-tuning becomes infeasible. |
| Approach: | They propose to freeze original pretrained weights and train a group of mini LoRAs with only a small number of parameters and reduce their rank by 8 times . |
| Outcome: | The proposed model uses fewer trainable parameters while maintaining a higher rank, thereby offering improved performance potential. |
How Much Knowledge Can You Pack into a LoRA Adapter without Harming LLM? (2025.findings-naacl)
Copied to clipboard
Sergey Pletenev, Maria Marina, Daniil Moskovskiy, Vasily Konovalov, Pavel Braslavski, Alexander Panchenko, Mikhail Salnikov
| Challenge: | Low-rank adaptation (LoRA) is a popular training technique for updating or domain-specific adaptation of Large Language Models (LLMs). |
| Approach: | They propose to use low-rank adaptation to incorporate new facts into the LLM without compromising previously learned knowledge. |
| Outcome: | The proposed approach is harmful because the model's performance declines after such fine-tuning. |
Fast Randomized Low-Rank Adaptation of Pre-trained Language Models with PAC Regularization (2024.findings-acl)
Copied to clipboard
| Challenge: | Low-rank adaptation (LoRA) is an efficient way to fine-tune large language models (LLMs) but its memory overhead restricts it to scale up when the model size increases. |
| Approach: | They propose a low-rank adaptation method which decomposes model weight updates into a pair of low-ranked projection matrices and incorporates a regularizer to improve generalization. |
| Outcome: | The proposed method achieves better performance under few-shot settings and similar performance to the SOTA low-rank adaptation methods. |
DenseLoRA: Dense Low-Rank Adaptation of Large Language Models (2025.acl-long)
Copied to clipboard
| Challenge: | Low-rank adaptation (LoRA) is an efficient approach for adapting large language models (LLMs) but many of the weights in these matrices are redundant, leading to inefficiencies in parameter utilization. |
| Approach: | They propose a low-rank adaptation approach that fine-tunes two low-ranked matrices and adapts them through a dense low-Rank matrix, improving parameter utilization and adaptation efficiency. |
| Outcome: | The proposed approach achieves 83.8% accuracy with only 0.01% of trainable parameters compared to LoRA's 80.8% with 0.70% of trainability parameters on LLaMA3-8B. |
SSH: Sparse Spectrum Adaptation via Discrete Hartley Transformation (2025.naacl-long)
Copied to clipboard
| Challenge: | Low-rank adaptation (LoRA) has been demonstrated effective in reducing the trainable parameter number when fine-tuning a large foundation model (LLM). |
| Approach: | They propose a low-rank adaptation approach that reduces the number of trainable parameters while enhancing model performance. |
| Outcome: | The proposed approach outperforms existing parameter-efficient fine-tuning methods while achieving substantial reductions in computational cost and memory requirements. |
LaMDA: Large Model Fine-Tuning via Spectrally Decomposed Low-Dimensional Adaptation (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Low-rank adaptation (LoRA) fine-tunes large language models due to its significant reduction in trainable parameters, but its backward updates require storing high-dimensional intermediate activations and optimizer states, requiring high peak GPU memory. |
| Approach: | They propose a low-dimensional adaptation approach to fine-tune large language models which freezes a first projection matrix while introducing a lower-dimensional trainable square matrix. |
| Outcome: | The proposed approach reduces trainable parameters and peak GPU memory footprint while preserving low-dimensional trainable square matrix. |
PMSS: Pretrained Matrices Skeleton Selection for LLM Fine-tuning (2025.coling-main)
Copied to clipboard
| Challenge: | Low-rank adaptation and its variants have been popular due to their ability to avoid excessive inference costs. |
| Approach: | They propose a low-rank adaptation method that enables high-rank updates with low costs while leveraging semantic and linguistic information inherent in pre-trained weight. |
| Outcome: | The proposed method outperforms LoRA and other fine-tuning methods across tasks with less trainable parameters. |
Polynomial Expansion Rank Adaptation: Enhancing Low-Rank Fine-Tuning with High-Order Interactions (2026.findings-acl)
Copied to clipboard
| Challenge: | Low-rank adaptation (LoRA) is a widely used strategy for efficient fine-tuning of large language models, but its strictly linear structure limits expressive capacity. |
| Approach: | They propose a method that introduces structured polynomial expansion directly into the low-rank factor space. |
| Outcome: | The proposed method outperforms state-of-the-art methods across diverse benchmarks. |
IAPT: Instance-Aware Prompt Tuning for Large Language Models (2024.acl-long)
Copied to clipboard
| Challenge: | Existing methods for prompt tuning require many soft tokens to guarantee performance . large language models still require a large amount of GPU memory and computations to fine-tune . |
| Approach: | They propose to use a parameter-efficient soft prompt generator to generate idiosyncratic soft prompts for each input instruction. |
| Outcome: | The proposed method outperforms the baselines with comparable tunable parameters and is more efficient than LoRA under the single-backbone multi-tenant setting. |
Low-Rank Interconnected Adaptation across Layers (2025.findings-acl)
Copied to clipboard
| Challenge: | Low-rank adaptation (LoRA) is a parameter-efficient fine-tuning (PEFT) method that learns weight updates W = AB for pretrained weights W through low-rank adapters A and B. |
| Approach: | They propose a low-rank interconnected adaptation across layers method that introduces an interconnected framework with locally shared A and globally shared B experts. |
| Outcome: | The proposed method improves expressiveness across domains and modalities and enables higher-rank W with equal or fewer parameters. |
An Orthogonal High-Rank Adaptation for Large Language Models (2025.emnlp-main)
Copied to clipboard
| Challenge: | Low-rank adaptation (LoRA) efficiently adapts LLMs to downstream tasks by decomposing LLM’s weight update into trainable low-rank matrices for fine-tuning. |
| Approach: | They propose an orthogonal high-rank adaptation for parameter-efficient fine-tuning that decomposes LLMs’ pre-trained weight matrices into orthogonals via QR decomposition and splits them into two low-redundancy high-ranked components. |
| Outcome: | Empirical results show that OHoRA outperforms LoRA and its variants and generates task-tailored representation spaces with 0.0371% trainable parameters. |
MiLoRA: Efficient Mixture of Low-Rank Adaptation for Large Language Models Fine-tuning (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Low-rank adaptation and its mixture-of-experts (MOE) methods are highly effective but introduce significant latency in multi-tenant settings due to the LoRA modules and MOE routers added to multiple linear modules. |
| Approach: | They propose a low-rank adaptation variant that considers each LoRA module as an expert and employs a prompt-aware routing mechanism. |
| Outcome: | Extensive analysis on commonsense reasoning tasks and math reasoning tasks show that MiLoRA outperforms strong PEFT baselines with comparable tunable parameter budgets. |